#pragma comment(linker, "/STACK:10000000")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#include <cassert>
#include <string>
#include <cstring>
#define ldb long double
#define LL long long
#define fi first
#define se second
#define fill(a, c) memset(a, c, sizeof(a))
#define sqr(a) ((a) * (a))
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define getBit(mask, k) (((mask) / pw[k]) % pw[1])
#define setBit(mask, k, l) (((mask) / pw[k + 1] * pw[1] + (l)) * pw[k] + ((mask) % pw[k]))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define ff first
#define ss second 
const ldb LDINF = 9128739847123.00;
const ldb eps = 1e-9;
const int inf = 1 << 28;
const ldb pi = fabsl(atan2l(0.0, -1.0));
using namespace std;

int n, m, c, k;
int qh, qt, q[1000000];
int was[52][52];
char a[52][52];
vector <pair <int , int> > path[32];


void load()
{
	cin >> n >> m >> c >> k;
	int s;
	for (int i = 0; i < c; i++)
	{
		scanf("%d", &s)
		path[i].resize(s);
		for (int j = 0; j < s; j++)
		{
			cin >> path[i][j].ff >> path[i][j].ss;
		}
	}
	nextLine();
	for (int i = 0; i < n; i++)
	{
		for (int j  = 0; j < m; j++)
		{
			a[i][j] = getchar();
			if (a[i][j] == '@')
			{
				start.ff = i;
				start.ss = j;
			}
			else if (a[i][j] == '$')
			{
				finish.ff = i;
				finish.ss = j;
			}
		}
		nextLine();
	}
}

inline bool in(int x, int y)
{
	return x >= 0 && x < n && y >=0 && y < m;
}

void solve()
{
	int qh = 0, qt = 0;
	q[qt++] = first;

}

#define file "maze"
int main()
{
	#ifndef ONLINE_JUDGE
		freopen(file".in", "rt", stdin);
		freopen(file".out", "wt", stdout);
	#endif
	load();
	solve();
	return 0;
}
